منابع مشابه
Least-squares inner product shaping
We develop methods that construct an optimal set of vectors with a specified inner product structure, from a given set of vectors in a complex Hilbert space. The optimal vectors are chosen to minimize the sum of the squared norms of the errors between the constructed vectors and the given vectors. Four special cases are considered. In the first, the constructed vectors are orthonormal. In the s...
متن کاملParallel Inner Product-Free Algorithm for Least Squares Problems
The performance of CGLS, a basic iterative method whose main idea is to organize the computation of conjugate gradient method applied to normal equations for solving least squares problems. On modern architecture is always limited because of the global communication required for inner products. Inner products often therefore present a bottleneck, and it is desirable to reduce or even eliminate ...
متن کاملCovariance shaping least-squares estimation
A new linear estimator is proposed, which we refer to as the covariance shaping least-squares (CSLS) estimator, for estimating a set of unknown deterministic parameters x observed through a known linear transformation H and corrupted by additive noise. The CSLS estimator is a biased estimator directed at improving the performance of the traditional least-squares (LS) estimator by choosing the e...
متن کاملA least-squares approach based on a discrete minus one inner product for first order systems
The purpose of this paper is to develop and analyze a least-squares approximation to a first order system. The first order system represents a reformulation of a second order elliptic boundary value problem which may be indefinite and/or nonsymmetric. The approach taken here is novel in that the least-squares functional employed involves a discrete inner product which is related to the inner pr...
متن کاملOrthonormal Polynomial Vectors and Least Squares Approximation for a Discrete Inner Product∗
We give the solution of a discrete least squares approximation problem in terms of orthonormal polynomial vectors with respect to a discrete inner product. The degrees of the polynomial elements of these vectors can be different. An algorithm is constructed computing the coefficients of recurrence relations for the orthonormal polynomial vectors. In case the weight vectors are prescribed in poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(01)00575-4